Constructing estimating equations from queue length data

نویسندگان

  • R. McVinish
  • P. K. Pollett
چکیده

In this paper we consider the problem of estimating the parameters of a Markov queueing model from discrete time observations of the queue length. The proposed approach is an application of the martingale estimating function methodology which has been used extensively in mathematical finance. A small simulation study suggests that the estimator performs well, even for moderate sample size, and that it is an improvement over the Gaussian diffusion based, approximate maximum likelihood estimator.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing estimating equations for queue

In this paper we consider the problem of estimating the parameters of a Markov queuing model from discrete time observations of the queue length. The proposed approach is an application of the martingale estimating function methodology which has been used extensively in mathematical finance. A small simulation study suggests that the estimator performs well, even for moderate sample size, and t...

متن کامل

A Method for Queue Length Estimation in an Urban Street Network Based on Roll Time Occupancy Data

A method estimating the queue length in city street networks was proposed using the data of roll time occupancy. The key idea of this paper is that when the queue length in front of the queue detector becomes longer, the speeds of the following vehicles to pass through the detector will become smaller, resulting in higher occupancy with constant traffic intensity. Considering the relationship b...

متن کامل

Queue-length balance equations in multiclass multiserver queues and their generalizations

A classical result for the steady-state queue-length distribution of single-class queueing systems is the following: the distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a departure epoch. The constraint for this result to be valid is that arrivals, and also service completions, with probability one occur individually, i.e., no...

متن کامل

Competitiveness in Transportation 2016 Control Strategies for Corridor Management Final Report

We consider the problem of estimating queue-lengths at an intersection from a pair of advance and stop bardetectors that count vehicles, when these measurements are noisyand biased. The key assumption is that the stop bar measurementreveals whether the queue is empty or not. We propose a real-time queue estimation algorithm based on stochastic gradientdescent. The algori...

متن کامل

VRED: An improvement over RED algorithm by using queue length growth velocity

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010